Pocket–pc Boolean Function Simplification
نویسندگان
چکیده
In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach. For the implementation, which provides optimal results, C++ coding was used on the Embedded Visual C++ 3.0 Pocket PC using Windows CE Operating System environment. In order to make the overall implementation efficient, the object oriented approach was used. Two examples are presented to illustrate the efficiency of the proposed algorithm. The proposed application is a useful tool for students and professors in the fields of electrical and computer engineering and computing sciences.
منابع مشابه
A Simplification Method of Polymorphic Boolean Functions
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be described by a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean function.
متن کاملComparison of Detailed and Generalized Campus Maps Used with a Pocket Pc
Map services have been integrated with mobile device services to allow users to get information at any place and at any time. Simple maps for small mobile device screens are necessary. Map generalization is a method for producing less complicated maps with more desirable properties. For this study, I produced suitable maps for mobile device services. The study area for the map research is the P...
متن کاملOptimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
It is well known that the Karnaugh-map technique is an elegant teaching resource for academics and a systematic and powerful tool for a digital designer in minimizing low order Boolean functions. Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits. Ther...
متن کاملSimplification of Boolean Algebra through DNA Computing
DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule...
متن کاملThe simplified weighted sum function and its average sensitivity
In this paper we simplify the definition of the weighted sum Boolean function which used to be inconvenient to compute and use. We show that the new function has essentially the same properties as the previous one. In particular, the bound on the average sensitivity of the weighted sum Boolean function remains unchanged after the simplification.
متن کامل